DELFT UNIVERSITY OF TECHNOLOGY REPORT 02-12 Some Numerical Aspects for Solving Sparse Large Linear Systems Derived from the Helmholtz Equation
نویسنده
چکیده
In this report, several numerical aspects and difficulties for solving a linear system derived from the time-harmonic wave equations are overviewed. The presentation begins with the derivation of the governing equation for waves propagating in general inhomogeneous media. Due to the need of numerical solutions, various discretizations based on finite difference are discussed. Some numerical methods which are considered applicable for solving the resulting large but sparse, indefinite, non-Hermitian linear system are discussed, including some types of existing preconditioners to possibly accelerate the convergence. Following demands for solving large linear problems in parallel computers, domain decomposition methods are revisited, with particular attentions on methods for solving the discrete Helmholtz equation.
منابع مشابه
Preconditioned Generalized Minimal Residual Method for Solving Fractional Advection-Diffusion Equation
Introduction Fractional differential equations (FDEs) have attracted much attention and have been widely used in the fields of finance, physics, image processing, and biology, etc. It is not always possible to find an analytical solution for such equations. The approximate solution or numerical scheme may be a good approach, particularly, the schemes in numerical linear algebra for solving ...
متن کاملCAS WAVELET METHOD FOR THE NUMERICAL SOLUTION OF BOUNDARY INTEGRAL EQUATIONS WITH LOGARITHMIC SINGULAR KERNELS
In this paper, we present a computational method for solving boundary integral equations with loga-rithmic singular kernels which occur as reformulations of a boundary value problem for the Laplacian equation. Themethod is based on the use of the Galerkin method with CAS wavelets constructed on the unit interval as basis.This approach utilizes the non-uniform Gauss-Legendre quadrature rule for ...
متن کاملDELFT UNIVERSITY OF TECHNOLOGY REPORT 08-12 Parallel Scientific Computing on Loosely Coupled Networks of Computers
Efficiently solving large sparse linear systems on loosely coupled networks of computers is a rich and vibrant field of research. The induced heterogeneity and volatile nature of the aggregated computational resources present numerous algorithmic challenges. Designing efficient numerical algorithms for said systems is a complex process that brings together many different scientific disciplines....
متن کاملDELFT UNIVERSITY OF TECHNOLOGY REPORT 08-08 Solving Large Sparse Linear Systems Efficiently on Grid Computers using an Asynchronous Iterative Method as a Preconditioner
In this paper we describe an efficient iterative algorithm for solving large sparse linear systems on Grid computers and review some of its advantages and disadvantages. The algorithm is a combination of a synchronous flexible outer iterative method and a coarse–grain asynchronous inner iterative method as a preconditioner. We present results of a complete implementation using mature Grid middl...
متن کاملDELFT UNIVERSITY OF TECHNOLOGY REPORT 08-05 Theoretical Comparison of Two-Level Preconditioners based on Multigrid and Deflation
It is well-known that two-level preconditioned conjugate gradient (PCG) methods provide efficient techniques for solving large and sparse linear systems whose coefficient matrices are symmetric and positive definite (SPD). A two-level PCG method combines traditional and projectiontype preconditioners to get rid of the effect of both small and large eigenvalues of the coefficient matrix. In the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002